Robust multi-group gene set analysis with few replicates
نویسندگان
چکیده
منابع مشابه
Improving Gene-Set Enrichment Analysis of RNA-Seq Data with Small Replicates
Deregulated pathways identified from transcriptome data of two sample groups have played a key role in many genomic studies. Gene-set enrichment analysis (GSEA) has been commonly used for pathway or functional analysis of microarray data, and it is also being applied to RNA-seq data. However, most RNA-seq data so far have only small replicates. This enforces to apply the gene-permuting GSEA met...
متن کاملMulti-objective scheduling and assembly line balancing with resource constraint and cost uncertainty: A “box” set robust optimization
Assembly lines are flow-oriented production systems that are of great importance in the industrial production of standard, high-volume products and even more recently, they have become commonplace in producing low-volume custom products. The main goal of designers of these lines is to increase the efficiency of the system and therefore, the assembly line balancing to achieve an optimal system i...
متن کاملQuality Control and Robust Estimation for cDNA Microarrays with Replicates
We consider robust estimation of gene intensities from cDNA microarray data with replicates. Several statistical methods for estimating gene intensities from microarrays have been proposed, but there has been little work on robust estimation. This is particularly relevant for experiments with replicates, because even one outlying replicate can have a disastrous effect on the estimated intensity...
متن کاملRobust Estimation of cDNA Microarray Intensities with Replicates
We consider robust estimation of gene intensities from cDNA microarray data with replicates. Several statistical methods for estimating gene intensities from microarrays have been proposed, but there has been little work on robust estimation of the intensities. This is particularly relevant for experiments with replicates, because even one outlying replicate can have a disastrous effect on the ...
متن کاملSet membership with a few bit probes
We consider the bit-probe complexity of the set membership problem, where a set S of size at most n from a universe of size m is to be represented as a short bit vector in order to answer membership queries of the form “Is x in S?” by adaptively probing the bit vector at t places. Let s(m,n, t) be the minimum number of bits of storage needed for such a scheme. Several recent works investigate s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2016
ISSN: 1471-2105
DOI: 10.1186/s12859-016-1403-0